Two-dimensional bin packing with one-dimensional resource augmentation
نویسندگان
چکیده
منابع مشابه
Two-dimensional bin packing with one-dimensional resource augmentation
The 2-dimensional Bin Packing problem is a generalization of the classical Bin Packing problems and is defined as follows: Given a collection of rectangles specified by their width and height, the goal is to pack these into minimum number of square bins of unit size. Recently, the problem was proved to be APX-hard even in the asymptotic case, i.e. when the optimum solutions requires a large num...
متن کاملOnline Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an algorithm were given the entire input in advance, it could give an optimal solution (in exponential time). Instead of giving the algorithm more knowledge about the input, in this paper we consider the effects of giving...
متن کاملVariants of Classical One-Dimensional Bin Packing
Joseph Y.-T. Leung New Jersey Institute of Technology 33.
متن کاملA one-dimensional bin packing problem with shelf divisions
Given bins of size B, non-negative values d and ∆, and a list L of items, each item e ∈ L with size se and class ce, we define a shelf as a subset of items packed inside a bin with total items size at most ∆ such that all items in this shelf have the same class. Two subsequent shelves must be separated by a shelf division of size d. The size of a shelf is the total size of its items plus the si...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2007
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.09.001